Visual Analysis of One-To-Many Matched Graphs

Motivated by applications of social network analysis and of Web search clustering engines, we describe an algorithm and a system for the display and the visual analysis of two graphs G1 and G2 such that each Gi is defined on a different data set with its own primary relationships and there are secondary relationships between the vertices of G1 and those of G2. Our main goal is to compute a drawing of G1 and G2 that makes clearly visible the relations between the two graphs by avoiding their crossings, and that also takes into account some other important aesthetic requirements like number of bends, area, and aspect ratio. Application examples and experiments on the system performances are also presented. Submitted: November 2008 Reviewed: July 2009 Revised: August 2009 Accepted: November 2009 Final: November 2009 Published: January 2010 Article type: Regular Paper Communicated by: I. G. Tollis and M. Patrignani Research partially supported by the miur Project “mainstream: Algorithms for Massive Information Structures and Data Streams”. E-mail addresses: [email protected] (Emilio Di Giacomo) [email protected] (Walter Didimo) [email protected] (Giuseppe Liotta) [email protected] (Pietro Palladino) 98 E. Di Giacomo at al. Visual Analysis of One-To-Many Matched Graphs